Ore-type conditions for the existence of even [2, b]-factors in graphs
نویسنده
چکیده
For even b 2, an even [2, b]-factor is a spanning subgraph each of whose degree is even between 2 and b. The main result is the following: a 2-edge-connected graph G of order n has an even [2, b]factor if the degree sum of each pair of nonadjacent vertices in G is at least max{4n/(2 + b), 5}. These lower bounds are best possible in some sense. The condition “2-edge-connected” cannot be dropped. This result was conjectured by Kouider and Vestergaard, and also is related to the study of Hamilton cycles, connected factors, spanning k-walks, and supereulerian graphs. Moreover, a related open problem is posed. © 2005 Elsevier B.V. All rights reserved.
منابع مشابه
Forcing spanning subgraphs via Ore type conditions
We determine an Ore type condition that allows the embedding of 3-colourable bounded degree graphs of sublinear bandwidth: For all ∆, γ > 0 there are β, n0 > 0 such that for all n ≥ n0 the following holds. Let G = (V,E) and H be n-vertex graphs such that H is 3-colourable, has maximum degree ∆(H) ≤ ∆ and bandwidth bw(H) ≤ βn, and G satisfies deg(u) + deg(v) ≥ ( 3 + γ)n for all uv / ∈ E. Then G ...
متن کاملCommon fixed points for a pair of mappings in $b$-Metric spaces via digraphs and altering distance functions
In this paper, we discuss the existence and uniqueness of points of coincidence and common fixed points for a pair of self-mappings satisfying some generalized contractive type conditions in $b$-metric spaces endowed with graphs and altering distance functions. Finally, some examples are provided to justify the validity of our results.
متن کاملCycles in 2-Factors of Balanced Bipartite Graphs
In the study of hamiltonian graphs, many well known results use degree conditions to ensure su1⁄2cient edge density for the existence of a hamiltonian cycle. Recently it was shown that the classic degree conditions of Dirac and Ore actually imply far more than the existence of a hamiltonian cycle in a graph G, but also the existence of a 2-factor with exactly k cycles, where 1U k U jV Gj 4 . I...
متن کاملA note on heavy cycles in weighted graphs
In [2], Bondy and Fan proved the existence of heavy cycle with Dirac-type weighted degree condition. And in [1], a similar result with Ore-type weighted degree condition is proved, however the conclusion is weaker than the one in [2]. Here we unify these two results, using a weighted degree condition weaker than Ore-type one.
متن کاملOre-type conditions implying 2-factors consisting of short cycles
For every graph G, let σ2(G) = min{d(x)+ d(y) : xy 6∈ E(G)}. The main result of the paper says that everyn-vertex graphGwithσ2(G) ≥ 4n 3 −1 contains each spanning subgraphH all whose components are isomorphic to graphs in {K1, K2, C3, K 4 , C + 5 }. This generalizes the earlier results of Justesen, Enomoto, andWang, and is a step towards an Ore-type analogue of the Bollobás–Eldridge–Catlin Conj...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 304 شماره
صفحات -
تاریخ انتشار 2005